A Frobenius Map Approach for an Efficient and Secure Multiplication on Koblitz
نویسنده
چکیده
The most efficient technique for protecting the using Frobenius algorithms for scalar multiplication on Koblitz curves against the Side Channel Attacks seems to be the multiplier randomization technique proposed by Joye and Tymen. In this paper, an heuristic analysis on the security of the Joye and Tymen’s technique is given. A new method improving this technique is proposed. Analysis shows that the proposed method reduce the cost of the Joye and Tymen’s technique by about 50%.
منابع مشابه
Scalar Multiplication on Pairing Friendly Elliptic Curves
Efficient computation of elliptic curve scalar multiplication has been a significant problem since Koblitz [13] and Miller [14] independently proposed elliptic curve cryptography, and several efficient methods of scalar multiplication have been proposed (e.g., [8], [9], [12]). A standard approach for computing scalar multiplication is to use the Frobenius endomorphism. If we compute the s-multi...
متن کاملSpeeding up the Scalar Multiplication in the Jacobians of Hyperelliptic Curves Using Frobenius Map
In [8] Koblitz suggested to make use of a Frobenius expansion to speed up the scalar multiplications in the Jacobians of hyperelliptic curves over the characteristic 2 field. Recently, Günther et. al.[6] have modified Koblitz’s Frobenius expansion method and applied it to the Koblitz curves of genus 2 over F2 to speed up the scalar multiplication. In this paper, we show that the method given in...
متن کاملKoblitz Curves and Integer Equivalents of Frobenius Expansions
Scalar multiplication on Koblitz curves can be very efficient due to the elimination of point doublings. Modular reduction of scalars is commonly performed to reduce the length of expansions, and τ -adic NonAdjacent Form (NAF) can be used to reduce the density. However, such modular reduction can be costly. An alternative to this approach is to use a random τ -adic NAF, but some cryptosystems (...
متن کاملArithmetic of Supersingular Koblitz Curves in Characteristic Three
We consider digital expansions of scalars for supersingular Koblitz curves in characteristic three. These are positional representations of integers to the base of τ , where τ is a zero of the characteristic polynomial T 2 ± 3T + 3 of a Frobenius endomorphism. They are then applied to the improvement of scalar multiplication on the Koblitz curves. A simple connection between τ -adic expansions ...
متن کاملParallel Formulations of Scalar Multiplication on Koblitz Curves
We present an algorithm that by using the τ and τ−1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical τ -and-add scalar multiplication algorithm for Koblitz elliptic curves. Furthermore, we report suitable irreducible polynomials that lead to efficient implementations of both τ and τ−1, thus showing that our algorithm can be effectively applied on all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 3 شماره
صفحات -
تاریخ انتشار 2006